Engulfing in word-hyperbolic groups

نویسندگان

  • G. A. Niblo
  • B. T. Williams
چکیده

We examine residual properties of word-hyperbolic groups, adapting a method introduced by Darren Long to study the residual properties of Kleinian groups. AMS Classification 20E26; 20F67, 20F65

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subgroups of Word Hyperbolic Groups in Dimension 2

If G is a word hyperbolic group of cohomological dimension 2, then every subgroup of G of type FP2 is also word hyperbolic. Isoperimetric inequalities are denned for groups of type FP2 and it is shown that the linear isoperimetric inequality in this generalized context is equivalent to word hyperbolicity. A sufficient condition for hyperbolicity of a general graph is given along with an applica...

متن کامل

2 Word Hyperbolic Semigroups

The study of automatic and word hyperbolic groups is a prominent topic in geometric group theory. The definition of automatic groups extends naturally to semigroups [3, 8], but word hyperbolic groups are defined by a geometric condition, the thin triangle condition, whose extension is not immediate. The problem is that for semigroups the metric properties of the Cayley diagram are not as closel...

متن کامل

Questions on Geometric Group Theory for the Max Dehn Seminar

1. If a closed irreducible 3-manifold has word hyperbolic fundamental group, does it admit a Riemannian metric of constant negative curvature? 2. Is every nitely presented subgroup of a word hyperbolic group word hyperbolic? (Noel Brady Brady] has spoken on an example of nitely presented subgroup H of a word hyperbolic group G where cd(G) = 3 and H is not hyperbolic. I had shown previously that...

متن کامل

Solving the word problem in real time

The purpose of this paper is to study groups with real-time word problem, that is for which the word problem can be solved with a deterministic, multitape Turing machine which reads its input at constant speed and completes the processing of its input as it finishes reading it. We start by proving a few elementary results concerning the closure properties of this family of groups. Then we show ...

متن کامل

Word Problem on Hyperbolic Groups

Hyperbolic groups are introduced as a class of groups for which there exists an algorithm to solve the word problem. The paper defines hyperbolic group, proves that they satisfy the conditions needed to apply Dehn’s algorithm, and finishes by describing the algorithm.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002